Error analysis in minimax trees
نویسندگان
چکیده
منابع مشابه
Error Minimizing Minimax Avoiding Search Pathology in Game Trees
Game-tree pathology is a phenomenon where deeper minimax search results in worse play. It was was discovered 30 years ago (Nau 1982) and shown to exist in a large class of games. Most games of interest are not pathological so there has been little research into searching pathological trees. In this paper we show that even in non-pathological games, there likely are pathological subtrees. Furthe...
متن کاملMinimax Trees in Linear Time
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which checks the Kraft Inequali...
متن کاملMinimax Trees in Linear Time with Applications
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which takes linear time when th...
متن کاملAlphabetic Minimax Trees in Linear Time
We develop a linear time algorithm algorithm for the following problem: given an ordered sequence of n real weights w1, w2, . . . , wn, construct a binary tree on n leaves labeled with those weights when read from left to right so that the maximum value of wi plus depth of the i-th leftmost leaf is minimized. This improves the previously known O(n logn) time solutions [2,11,13]. We also give a ...
متن کاملMinimax Programs, Bitonic Columns and Pq Trees
1 Overview Among hard combinatorial optimization problems there is an increasing body of special cases known in which optimal solutions can be obtained eeciently. These special cases may be expressed as constraints on graph structure, such as chordal or interval graphs 4, 6] which allow linear-time solution of problems like vertex coloring, or Monge matrix edge weights which allow eecient solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2002.10.004